[[Combinatorics MOC]]
# Latin square

A **Latin square** is an $n \times n$ array filled with $n$ symbols such that each symbol occurs exactly once in each row and exactly once in each column. #m/def/comb 
This corresponds precisely to the Cayley table of a [[Quasigroup]], of which a [[Group]] is a special case.

## Properties

- [[Diagonal frequency of a Latin square]]
- [[Completion of a Latin square from its diagonal]]


#
---
#state/develop | #lang/en | #SemBr